Combining Hilbert Style and Semantic Reasoning in a Resolution Framework

نویسنده

  • Hans Jürgen Ohlbach
چکیده

Proceedings of CADE-15, LNAI 1421, pp. 205–219, 1998 Many non-classical logics can be axiomatized by means of Hilbert Systems. Reasoning in Hilbert Systems, however, is extremely inefficient. Most inference methods therefore use the semantics of a logic in one kind or another to get more efficiency. In this paper a combination of Hilbert style and semantic reasoning is proposed. It is particularly tailored for cases where either the semantics of some operators is not known, or it is second-order, or it is just too complicated to handle, or flexibility in experimenting with different versions of a logic is required. First-order predicate logic is used as a meta-logic for combining the Hilbert part with the semantics part. Reasoning is done in a (theory) resolution framework. The basic method is applicable to many different (monotonic propositional) non-classical logics. It can, however, be improved by treating particular formulae in a special way, as rewrite rules, as theory unification or theory resolution rules, even as recursive calls to a theorem prover. Examples for all these cases are presented in the paper.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Synthesizing di erent development paradigms : Combining top - down with bottom - up reasoning about distributedsystems 1

Our goal is the presentation of a uniform framework for compositional reasoning about the development of distributed processes and data structures.This framework should be a synthesis because, depending on the structure of the processes involved and the veriication steps required, diierent formalisms are most suitable for carrying out one's reasoning. We illustrate this uniform framework by pre...

متن کامل

Logical Analysis of Demonic Nondeterministic Programs

A logical framework is presented for representing and reasoning about nondeterministic programs that may not terminate. We propose a logic PDL(; ;, ||, d(∗)) which is an extension of dynamic logic such that the program constructors related to demonic operations are introduced in its language. A complete and sound Hilbert-style proof system is given and it is shown that PDL(; ;, ||, d(∗)) is dec...

متن کامل

Semantic Priming Effect on Relative Clause Attachment Ambiguity Resolution in L2

This study examined whether processing ambiguous sentences containing relative clauses (RCs) following a complex determiner phrase (DP) by Persian-speaking learners of L2 English with different proficiency and working memory capacities (WMCs) is affected by semantic priming. The semantic relationship studied was one between the subject/verb of the main clause and one of the DPs in the complex D...

متن کامل

A Framework for Combining Rules and Geo-ontologies

Geo-ontologies have a key role to play in the development of the geospatial-semantic web, with regard to facilitating the search for geographical information and resources. They normally hold large amounts of geographic information and undergo a continuous process of revision and update. Hence, means of ensuring their integrity are crucial and needed to allow them to serve their purpose. This p...

متن کامل

Non-Clausal Reasoning with Definite Theories

In this paper we propose a general-purpose first-order automated reasoning framework based on the notion of a definite formula and on a non-clausal variant of SLD-resolution. This framework provides a universal Horn clause-like representation of knowledge for classical as well as a range of non-classical first-order logics. It provides a resolution-style method for automated reasoning with theo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998